Limited resource strategy in resolution theorem proving

Limited resource strategy in resolution theorem proving

Resolution Theorem Proving

Lifting is one of the most important general techniques for accelerating dii-cult computations. Lifting was used by Alan Robinson in the early 1960's to accelerate rst order inference Robinson, 1965]. A complete inference procedure had been done by Martin Davis and Hillary Putnam a few years prior to Robinson's work Davis and Putnam, 1960]. Unfortunately, it was a ground procedure and suuered f...

Non-Resolution Theorem Proving

This talk reviews those efforts in automatic theorem proving, during the past few years, which have emphasized techniques other than resolution. These include: knowledge bases, natural deduction, reduction, (rewrite rules), typing, procedures, advice, controlled forward chaining, algebraic simplification, built-in associativity and commutativity, models, analogy, and man-machine systems. Exampl...

Resource Adaptive Agents in Interactive Theorem Proving

We introduce a resource adaptive agent mechanism which supports the user in interactive theorem proving. The mechanism, an extension of [4], uses a two layered architecture of agent societies to suggest appropriate commands together with possible command argument instantiations. Experiments with this approach show that its e ectiveness can be further improved by introducing a resource concept. ...

Strategy Parallelism in Automated Theorem Proving

Automated theorem provers use search strategies. Unfortunately, there is no unique strategy which is uniformly successfifl on "all problems. A combination of more thmx one strategy increases the chances of success. Limitations of resources m~ time or processors enforce efficient use of these resources by partitioning the resources adequately among thc involved strategies. This leads to an optim...